Sieve Methods in Random Graph Theory
نویسندگان
چکیده
In this paper, we apply the Turan sieve and simple developed by R. Murty first author to study problems in random graph theory. particular, obtain upper lower bounds on probability of a n vertices having diameter 2 (or 3 case bipartite graphs) with edge p(n) where edges are chosen independently . An interesting feature revealed these results is that `almost completely' complement each other. As corollary our result, note approaches 1 as infinity for constant p(n)=1/2. This an appendix shorter version paper.
منابع مشابه
Sieve Methods in Group Theory I: Powers in Linear Groups
The sieve method is a classic one in number theory (see, for example, [FI]). Recently it found some applications in a non-commutative setting. On the one hand, Bourgain-Gamburd-Sarnak [BGS1] applied it in studying almost-prime vectors in orbits of non-commutative groups acting on Z. On the other hand, Rivin [Ri] and Kowalski [Ko] used it to study generic properties of elements in the mapping cl...
متن کاملSieve Methods
Preface Sieve methods have had a long and fruitful history. The sieve of Eratosthenes (around 3rd century B.C.) was a device to generate prime numbers. Later Legendre used it in his studies of the prime number counting function π(x). Sieve methods bloomed and became a topic of intense investigation after the pioneering work of Viggo Brun (see [Bru16],[Bru19], [Bru22]). Using his formulation of ...
متن کاملSieve methods in combinatorics
We develop the Turán sieve and a ‘simple sieve’ in the context of bipartite graphs and apply them to various problems in combinatorics. More precisely, we provide applications in the cases of characters of abelian groups, vertex-colourings of graphs, Latin squares, connected graphs, and generators of groups. In addition, we give a spectral interpretation of the Turán sieve. © 2004 Elsevier Inc....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2023
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-023-02635-x